Probabilistic and prioritized models of timed CSP
نویسندگان
چکیده
منابع مشابه
Probabilistic and Prioritized Models of Timed CSP
In this paper we present two languages that are reenements of timed CSP 4]: a proba-bilistic language, and a fully deterministic language with a notion of priority. In the rst part of the paper we describe the deterministic language and its semantic model. The syntax is based upon that of timed CSP except some of the operators are reened so as to remove all nondeterminism; this produces priorit...
متن کاملProgramming Research Group Some Extensions to the Probabilistic, Biased Model of Timed Csp Some Extensions to the Probabilistic, Biased Model of Timed Csp
In a previous paper Low92] we presented two languages based upon timed CSP, with associated semantic models. The rst language included biased operators in the syntax, which could be used to model diierent priorities on actions. The second language extended this by adding a probabilistic choice operator to the syntax; this allowed us to give a semantics which modelled the probabilities of diiere...
متن کاملTimed CSP: A Retrospective
We review the development of the process algebra Timed CSP, from its inception nearly twenty years ago to very recent semantical and algorithmic developments.
متن کاملTimed CSP Simulator
Time is an integral aspect of computer systems. It is essential for modelling a system’s performance and also affects its safety or security. Timed Csp [5] conservatively extends the process algebra CSP with timed primitives, where real numbers ≥ 0 model how time passes with reference to a single, conceptually global, clock. While there have been approaches for model checking Timed Csp [1, 5], ...
متن کاملMachine-Checkable Timed CSP
The correctness of safety-critical embedded software is crucial, whereas non-functional properties like deadlock-freedom and real-time constraints are particularly important. The real-time calculus Timed CSP is capable of expressing such properties and can therefore be used to verify embedded software. In this paper, we present our formalization of Timed CSP in the Isabelle/HOL theorem prover, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00171-e